Remarks on Extremal Overfull Graphs
نویسندگان
چکیده
منابع مشابه
Remarks on Distance-Balanced Graphs
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.
متن کاملRemarks on s-Extremal Codes
We study s-extremal codes over F4 or over F2. A Type I self-dual code over F4 or over F2 of length n and minimum distance d is s-extremal if the minimum weight of its shadow is largest possible. The purpose of this paper is to give some results which are missing in a series of papers by Bachoc and Gaborit [2], by Gaborit [6], and by Bautista, et. al. [1]. In particular, we give an explicit form...
متن کاملremarks on distance-balanced graphs
distance-balanced graphs are introduced as graphs in which every edge uv has the followingproperty: the number of vertices closer to u than to v is equal to the number of vertices closerto v than to u. basic properties of these graphs are obtained. in this paper, we study theconditions under which some graph operations produce a distance-balanced graph.
متن کاملEccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملOn extremal k-supereulerian graphs
A graph G is called k-supereulerian if it has a spanning even subgraph with at most k components. In this paper, we prove that any 2-edge-connected loopless graph of order n is ⌈(n − 2)/3⌉-supereulerian, with only one exception. This result solves a conjecture in [Z. Niu, L. Xiong, Even factor of a graphwith a bounded number of components, Australas. J. Combin. 48 (2010) 269–279]. As applicatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics
سال: 2013
ISSN: 2152-7385,2152-7393
DOI: 10.4236/am.2013.48149